package com.wangyadong.hobby.schedule.jobtask.dsa.recursive;

public class FactorialFunction {


    public static int recursive(int n) {
        if (n == 0) {
            return 1;
        }
        return recursive(n - 1) * n;

    }

    public static void main(String[] args) {
        System.out.println(recursive(6));
    }
}
